def binary_cut(s):
no_of_pieces = 0
ptr = 0
while ptr < len(s):
while ptr < len(s) and s[ptr] == '1':
ptr += 1
start = ptr
while ptr < len(s) and s[ptr] == '0':
ptr += 1
if ptr >= len(s):
break
else:
no_of_pieces += 1
while ptr < len(s) and s[ptr] == '1':
ptr += 1
end = ptr
s = s[:start] + s[end:]
break
ptr = 0
while ptr < len(s):
if s[ptr] == '0':
while ptr < len(s) and s[ptr] == '0':
ptr += 1
no_of_pieces += 1
else:
while ptr < len(s) and s[ptr] == '1':
ptr += 1
no_of_pieces += 1
return no_of_pieces
T = int(input())
for _ in range(T):
S = input()
print(binary_cut(S))952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |
Back to School | I am Easy |
Teddy and Tweety | Partitioning binary strings |
Special sets | Smallest chosen word |